QoS Routing in Hypercube Multicomputers
نویسندگان
چکیده
"!$# &% %' )( +*, -%.($ /! 0 12 . 354 !$# 12 ! 10 % ! .($ 76 198 : 1 ( 4 ! ;1 <#/= %' )($ >' 4 ? ! 1 4 % ! )($ @ # A 12 3B4 !$# 12 5>C D1 E? 1/ ?; F G ? 3 1 ($ !$# 4 * # )($ < #D 12 /! )(H ! *5 !$# ! 3 # >'1 ($ ! 1 3 !$# )(I6 1/8J 1 ( 4 ! 1 K8.%' ) MLC ?;? = #N 12 . 4 /! O P6 1/8GQ ! 1 (<* # )($ !$# SR :T!$# )?; 4 /! ($ )% ($ /! !$# 3 C (H /! U6 198V%' )( 1 ( 4 ! 1W W ! :
منابع مشابه
Combined Routing and Scheduling of Concurrent Communication Traffic in Hypercube Multicomputers
|We propose and evaluate low-complexity, low-overhead schemes for distributed message scheduling and routing in binary hypercube multicomputers equipped with a hardware communication adapter at each node. The goal is to optimize the network performance not only for steady traac ow, but also for concurrent bursty traac. We comparatively evaluate the performance of diierent scheduling{routing com...
متن کاملEfficient Implementation of Barrier Synchronization in Wormhole-Routed Hypercube Multicomputers
This paper addresses eecient implementation of barrier synchronization in wormhole-routed hypercube multicomputers. For those systems supporting only unicast communication in hardware, a novel software tree approach, the U-cube tree, is proposed. An important feature of the U-cube tree is that all messages injected into the network are guaranteed to be contention-free. Performance measurements ...
متن کاملParallel Processing Letters C World Scientific Publishing Company
In this paper, we present a coding method to capture QoS information in hypercube multicomputers. The coding method is based on a localized algorithm where each node interacts with its neighbors to gather QoS information. Specifically, each node maintains a QoS vector where the k-th element represents the guaranteed QoS performance to a destination that is k hops away. The localized algorithm e...
متن کاملAdvanced operations research techniques for multi-constraint QoS routing in internet
Internet Traffic has grown exponentially over last few years due to provision of multiple class services through Internet backbone. With the explosive use of Internet, contemporary Internet routers are susceptible to overloads and their services deteriorate drastically and often cause denial of services. In this paper, an analysis is made how forecasting technique, routing algorithm and Genetic...
متن کاملAdaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors
Reliable communication in cube-based multicomputers using the safety vector concept is studied in this paper. In our approach, each node in a cube-based multicomputer of dimension n is associated with a safety vector of n bits, which is an approximated measure of the number and distribution of faults in the neighborhood. The safety vector of each node can be easily calculated through n 1 rounds...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Processing Letters
دوره 13 شماره
صفحات -
تاریخ انتشار 2003